Average trapping time on weighted directed Koch network
نویسندگان
چکیده
منابع مشابه
Dynamic consensus estimation of weighted average on directed graphs
Taylor & Francis makes every effort to ensure the accuracy of all the information (the “Content”) contained in the publications on our platform. However, Taylor & Francis, our agents, and our licensors make no representations or warranties whatsoever as to the accuracy, completeness, or suitability for any purpose of the Content. Any opinions and views expressed in this publication are the opin...
متن کاملConsensus on the average in arbitrary directed network topologies with time-delays
In this preliminary paper we study the stability property of a consensus on the average algorithm in arbitrary directed graphs with respect to communication/sensing timedelays. The proposed algorithm adds a storage variable to the agents’ states so that the information about the average of the states is preserved despite the algorithm iterations are performed in an arbitrary strongly connected ...
متن کاملOn weighted directed graphs
Article history: Received 6 January 2011 Accepted 16 June 2011 Available online 18 July 2011 Submitted by S. Kirkland AMS classification: 05C50 05C05 15A18
متن کاملModified box dimension and average weighted receiving time on the weighted fractal networks
In this paper a family of weighted fractal networks, in which the weights of edges have been assigned to different values with certain scale, are studied. For the case of the weighted fractal networks the definition of modified box dimension is introduced, and a rigorous proof for its existence is given. Then, the modified box dimension depending on the weighted factor and the number of copies ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Scientific Reports
سال: 2019
ISSN: 2045-2322
DOI: 10.1038/s41598-019-51229-2